منابع مشابه
Quantum Hamiltonian Complexity
Constraint satisfaction problems are a central pillar of modern computational complexity theory. This survey provides an introduction to the rapidly growing field of Quantum Hamiltonian Complexity, which includes the study of quantum constraint satisfaction problems. Over the past decade and a half, this field has witnessed fundamental breakthroughs, ranging from the establishment of a “Quantum...
متن کاملQuantum Hamiltonian complexity and the detectability lemma
Local Hamiltonians, the central object of study in condensed matter physics, are the quantum analogue of CSPs, and ground states of Hamiltonians are the quantum analogue of satisfying assignments. The major difference between the two is the existence of multi-particle entanglement in the ground state, which introduces a whole new level of difficulty in tackling questions such as quantum PCP, qu...
متن کاملComplexity One Hamiltonian
We consider compact connected six dimensional symplectic mani-folds with Hamiltonian SU(2) or SO(3) actions with cyclic principal stabilizers. We classify such manifolds up to equivariant symplectomorphisms.
متن کاملQuantum Bi-Hamiltonian Systems
We define quantum bi-Hamiltonian systems, by analogy with the classical case, as derivations in operator algebras which are inner derivations with respect to two compatible associative structures. We find such structures by means of the associative version of Nijenhuis tensors. Explicit examples, e.g. for the harmonic oscillator, are given.
متن کاملHamiltonian for Quantum Copying
We derive an explicit Hamiltonian for copying the basis up and down states of a quantum two-state system—a qubit—onto n " copy " qubits (n ≥ 1) initially all prepared in the down state. In terms of spin components , for spin-1 2 particle spin states, the resulting Hamiltonian involves n-and (n + 1)-spin interactions. The case n = 1 also corresponds to a quantum-computing controlled-NOT gate.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations and Trends® in Theoretical Computer Science
سال: 2015
ISSN: 1551-305X,1551-3068
DOI: 10.1561/0400000066